Capacity of a Class of State-Dependent Orthogonal Relay Channels
نویسندگان
چکیده
منابع مشابه
Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملThe capacity of a class of state-dependent relay channel with orthogonal components and side information at the source and the relay
In this paper, a class of state-dependent relay channel with orthogonal channels from the source to the relay and from the source and the relay to the destination is studied. The two orthogonal channels are corrupted by two independent channel states SR and SD, respectively, which are known to both the source and the relay. The lower bounds on the capacity are established for the channel either...
متن کاملA Broadcasting Relay for Orthogonal Multiuser Channels
This paper introduces broadcasting relay nodes for orthogonal multiuser channels. The underlying idea is that a single relay node is shared by multiple source-destination pairs. In this scheme, the relay node receives the messages of multiple independent sources, and broadcasts a single superimposed signal to multiple destinations. Compared to dedicated relay scenarios, large gains in capacity ...
متن کاملCapacity Bounds for State-Dependent Broadcast Channels
In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a sender broadcasting two independent messages to two non-cooperating receivers; for channels of the second class, each receiver is given the message it need n...
متن کاملOn the Capacity of Gaussian Relay Channels
Determining the capacity of Gaussian relay channels even with one relaying station has been an open problem for several decades. This paper presents a pair of upper and lower bounds whose gap is no more than 0.5 bit per channel use, for the capacity of Gaussian relay channels with one relaying station.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2514343